Graphical representations and cluster algorithms for critical points with fields
نویسندگان
چکیده
منابع مشابه
Graphical representations and cluster algorithms II
We continue the study, initiated in Part I, of graphical representations and cluster algorithms for various models in (or related to) statistical mechanics. For certain models, e.g. the Blume–Emery– Gri ths model and various generalizations, we develop Fortuin Kasteleyn-type representations which lead immediately to Swendsen Wang-type algorithms. For other models, e.g. the random cluster model,...
متن کاملGraphical representations and cluster algorithms I . Discrete spin systems
Graphical representations similar to the FK representation are developed for a variety of spin-systems. In several cases, it is established that these representations have (FKG) mono-tonicity properties which enables characterization theorems for the uniqueness phase and the low-temperature phase of the spin system. Certain systems with intermediate phases and/or first-order transitions are als...
متن کاملGraphical Representations for Ising Systems in External Fields
A graphical representation based on duplication is developed that is suitable for the study of Ising systems in external fields. Two independent replicas of the Ising system in the same field are treated as a single four-state (Ashkin-Teller) model. Bonds in the graphical representation connect the Ashkin-Teller spins. For ferromagnetic systems it is proved that ordering is characterized by per...
متن کاملMonodromy problem for the degenerate critical points
For the polynomial planar vector fields with a hyperbolic or nilpotent critical point at the origin, the monodromy problem has been solved, but for the strongly degenerate critical points this problem is still open. When the critical point is monodromic, the stability problem or the center- focus problem is an open problem too. In this paper we will consider the polynomial planar vector fields ...
متن کاملImprecise Probabilistic Graphical Models: Equivalent Representations, Inference Algorithms and Applications
Credal networks are probabilistic graphical models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Credal nets appear to be powerful means to represent and deal with many important and challenging problems in uncertain reasoning. The counterpart of having more freedom in the modeling phase is an increased inferential comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 1998
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.58.2749